runtime.sudog.next (field)

50 uses

	runtime (current package)
		chan.go#L873: 	sgp.next = nil
		chan.go#L882: 	x.next = sgp
		chan.go#L892: 		y := sgp.next
		chan.go#L899: 			sgp.next = nil // mark as removed (see dequeueSudoG)
		mgc.go#L1844: 		sgnext = sg.next
		mgc.go#L1845: 		sg.next = nil
		proc.go#L502: 			sched.sudogcache = s.next
		proc.go#L503: 			s.next = nil
		proc.go#L531: 	if s.next != nil {
		proc.go#L560: 				last.next = p
		proc.go#L565: 		last.next = sched.sudogcache
		runtime2.go#L335: 	next *sudog
		select.go#L629: 	y := sgp.next
		select.go#L633: 			x.next = y
		select.go#L635: 			sgp.next = nil
		select.go#L640: 		x.next = nil
		select.go#L649: 		sgp.next = nil
		sema.go#L307: 	s.next = nil
		sema.go#L323: 				s.next = t.next
		sema.go#L327: 				if s.next != nil {
		sema.go#L328: 					s.next.parent = s
		sema.go#L342: 				t.next = nil
		sema.go#L363: 			pt = &t.next
		sema.go#L387: 			if s.parent.next != s {
		sema.go#L412: 			ps = &s.next
		sema.go#L431: 		t.next = s.next
		sema.go#L432: 		if t.next != nil {
		sema.go#L433: 			t.next.parent = t
		sema.go#L454: 		for s.next != nil || s.prev != nil {
		sema.go#L455: 			if s.next == nil || s.prev != nil && s.prev.ticket < s.next.ticket {
		sema.go#L466: 				s.parent.next = nil
		sema.go#L475: 	s.next = nil
		sema.go#L486: 	y := x.next
		sema.go#L491: 	x.next = b
		sema.go#L502: 		if p.next != x {
		sema.go#L505: 		p.next = y
		sema.go#L515: 	b := x.next
		sema.go#L517: 	x.next = y
		sema.go#L530: 		if p.next != y {
		sema.go#L533: 		p.next = x
		sema.go#L603: 		l.tail.next = s
		sema.go#L639: 		next := s.next
		sema.go#L640: 		s.next = nil
		sema.go#L685: 	for p, s := (*sudog)(nil), l.head; s != nil; p, s = s, s.next {
		sema.go#L687: 			n := s.next
		sema.go#L689: 				p.next = n
		sema.go#L697: 			s.next = nil